Maximizing the optical network capacity

نویسندگان

  • Polina Bayvel
  • Robert Maher
  • Tianhua Xu
  • Gabriele Liga
  • Nikita A Shevchenko
  • Domaniç Lavery
  • Alex Alvarado
  • Robert I Killey
چکیده

Most of the digital data transmitted are carried by optical fibres, forming the great part of the national and international communication infrastructure. The information-carrying capacity of these networks has increased vastly over the past decades through the introduction of wavelength division multiplexing, advanced modulation formats, digital signal processing and improved optical fibre and amplifier technology. These developments sparked the communication revolution and the growth of the Internet, and have created an illusion of infinite capacity being available. But as the volume of data continues to increase, is there a limit to the capacity of an optical fibre communication channel? The optical fibre channel is nonlinear, and the intensity-dependent Kerr nonlinearity limit has been suggested as a fundamental limit to optical fibre capacity. Current research is focused on whether this is the case, and on linear and nonlinear techniques, both optical and electronic, to understand, unlock and maximize the capacity of optical communications in the nonlinear regime. This paper describes some of them and discusses future prospects for success in the quest for capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Allocation of Electric Vehicles' Parking Lots in Distribution System Considering Urban Traffic

Abstract: Parking lots for electric vehicles (EVs) can make good utilization of the EVschr('39') battery capacity due to the large number of EVs. However, the location and size of parking lots will affect the distribution network condition. In this paper, a mixed-integer linear programming (MILP) model is proposed for locating and determining the optimal capacity of EVschr('39') parking lots co...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...

متن کامل

A Two-Stage Chance-Constraint Stochastic Programming Model for Electricity Supply Chain Network Design

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...

متن کامل

A Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value

This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).&#10In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...

متن کامل

A new predictive dynamic priority scheduling in Ethernet passive optical networks (EPONs)

Efficient uplink scheduling in Ethernet passive optical networks (EPONs) is very important for maximizing the network capacity while maintaining the required quality of service (QoS). Several variants of dynamic bandwidth resource allocation have been proposed in recent research literature. However, the available techniques do not fully exploit the elastic properties of the user traffic. In thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 374  شماره 

صفحات  -

تاریخ انتشار 2016